Technical Note—A “Hard” Assignment Problem
نویسندگان
چکیده
منابع مشابه
On solving a hard quadratic 3-dimensional assignment problem
We address the exact solution of a very challenging (and previously unsolved) instance of the quadratic 3-dimensional assignment problem, arising in digital wireless communications. When error correction of a transmitted message is not possible, an automatic repeat request (ARQ) may be sent. For the case of PSK coding we describe the techniques developed to solve this instance to proven optimal...
متن کاملOn some Hard-to-Solve versions of the Assignment Problem
Some hard-to-solve versions of the Assignment Problem are studied. Results of scientific research of approximation algorithms for the multi-index Assignment Problem are presented in axial and planar cases. There are established performance guarantees and conditions of asymptotic exactness for approximate solutions obtained.
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملRobust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملBatch Scheduling and Common Due Date Assignment Problem: an NP-hard Case
An important special case of the problem studied in Cheng and Kovalyov (1996) arises when there are equal setup times and equal job processing times. Computational complexity of this case was indicated to be open, however. I prove its NP-hardness. Cheng and Kovalyov [l] introduced the following due date assignment and scheduling problem. There are n groups of jobs to be scheduled for processing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1976
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.24.1.190